package binary_tree;

public class BSTTest {
    public static void main(String[] args) {
   BST bst=new BST();
   int[] data={41,42,50,53,59,58,60,63,61};
        for (int i = 0; i < data.length; i++) {
            bst.add(data[i]);
        }
//        bst.add(35);
//        System.out.println(bst);
//        System.out.println(bst.contains(45));
//        System.out.println(bst.contains(13));
//        System.out.println(bst.maxNum());
//        System.out.println(bst.minNum());
//        System.out.println("删除的元素是："+bst.removeMin());
//        System.out.println("删除的元素是："+bst.removeMax());
//        System.out.println(bst);
        bst.remove(58);
        System.out.println(bst);

    }
}
